A Grover-search based quantum learning scheme for classification

نویسندگان

چکیده

Abstract The hybrid quantum–classical learning scheme provides a prominent way to achieve quantum advantages on near-term devices. A concrete example toward this goal is the neural network (QNN), which has been developed accomplish various supervised tasks such as classification and regression. However, there are two central issues that remain obscure when QNN exploited tasks. First, classifier can well balance computational cost number of measurements performance unexplored. Second, it unclear whether classifiers be applied solve certain problems outperform their classical counterparts. Here we devise Grover-search based (GBLS) address above issues. Notably, most existing QNN-based seamlessly embedded into proposed scheme. key insight behind our proposal reformulating search problem. Numerical simulations exhibit GBLS comparable with other under noise settings, while required dramatically reduced. We further demonstrate potential advantage over in measure query complexity. Our work guidance develop advanced devices opens up an avenue explore

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning about Grover ’ s Quantum Search

MICHAEL BUTLER and PIETER HARTEL Department of Electronics & Computer Science University of Southampton Southampton SO17 1BJ United Kingdom {mjb,phh}@ecs.soton.ac.uk Grover's search algorithm is designed to be executed on a quantum-mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides...

متن کامل

A Grover-based quantum search of optimal order for an unknown number of marked elements

We want to find a marked element out of a black box containing N elements. When the number of marked elements is known this can be done elegantly with Grover’s algorithm, a variant of which even gives a correct result with certainty. On the other hand, when the number of marked elements is not known the problem becomes more difficult. For every prescribed success probability I give an algorithm...

متن کامل

Global Optimization with Quantum Walk Enhanced Grover Search

One of the significant breakthroughs in quantum computation is Grover’s algorithm for unsorted database search. Recently, the applications of Grover’s algorithm to solve global optimization problems have been demonstrated, where unknown optimum solutions are found by iteratively improving the threshold value for the selective phase shift operator in Grover rotation. In this paper, a hybrid appr...

متن کامل

Analysis of generalized Grover quantum search algorithms using recursion equations

Eli Biham, Ofer Biham, David Biron,* Markus Grassl, Daniel A. Lidar, and Daniel Shapira Computer Science Department, Technion, Haifa 32000, Israel Racah Institute of Physics, The Hebrew University, Jerusalem 91904, Israel Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, Am Fasanengarten 5, D-76128 Karlsruhe, Germany Department of Chemistry, University of California, Berkel...

متن کامل

Grover search algorithm

A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum state transformation, operations themselves must be unitary (reversible). Most quantum algorithms involve a series of quantum state transformations followed b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: New Journal of Physics

سال: 2021

ISSN: ['1367-2630']

DOI: https://doi.org/10.1088/1367-2630/abdefa